Number of 1-Factorizations of Regular High-Degree Graphs
نویسندگان
چکیده
منابع مشابه
1-Factorizations of random regular graphs
It is shown that for each r 3, a random r-regular graph on 2n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2n vertices, as n ! 1. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almost sure in one sequence of spaces are almost sure in the other, and vice versa. The corresponding sta...
متن کاملRegular Graphs of High Degree Are 1-factorizable
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ^ n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n —1 or 2n — 2. We show here that it is true for d(G) equal to2n — 3, In — 4, or2n — 5. We also show that it is true for $|K(G)|.
متن کاملEdge coloring regular graphs of high degree
We discuss the following conjecture: If G = (V; E) is a-regular simple graph with an even number of vertices at most 22 then G is edge colorable. In this paper we show that the conjecture is true for large graphs if jV j < (2 ?)). We discuss related results.
متن کاملRandom regular graphs of high degree
Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d n grows more quickly than √n. These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others. © 2001 John Wi...
متن کاملThe total chromatic number of regular graphs of even order and high degree
The total chromatic number T (G) of a graph G is the minimum number of colours needed to colour the edges and the vertices ofG so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and (G) 3 |V (G)| + 23 6 , then T (G) (G)+ 2. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2020
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-3970-y